m-dominating k-ended trees of graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incidence dominating numbers of graphs

In this paper, the concept of incidence domination number of graphs  is introduced and the incidence dominating set and  the incidence domination number  of some particular graphs such as  paths, cycles, wheels, complete graphs and stars are studied.

متن کامل

The k-dominating cycles in graphs

For a graph G, let σ̄k+3(G) = min {d(x1) + d(x2) + · · · + d(xk+3) − |N(x1) ∩ N(x2) ∩ · · · ∩ N(xk+3)| | x1, x2, · · · , xk+3 are k + 3 independent vertices in G}. In [5], H. Li proved that if G is a 3-connected graph of order n and σ̄4(G) ≥ n+3, then G has a maximum cycle such that each component of G−C has at most one vertex. In this paper, we extend this result as follows. Let G be a (k + 2)-c...

متن کامل

Closure for Spanning Trees with k-Ended Stems

Let T be a tree. The set of leaves of T is denoted by ( ) Leaf T . The subtree ( ) Leaf T T − of T is called the stem of T . A stem is called a k-ended stem if it has at most k-leaves in it. In this paper, we prove the following theorem. Let G be a connected graph and 2 k ≥ be an integer. Let u and v be a pair of nonadjacent vertices in G . Suppose that ( ) ( ) 1 G G N u N v G k ≥ − −  . Then ...

متن کامل

On minimum m -connected k -dominating set problem in unit disc graphs

Minimum m-connected k-dominating set problem is as follows: Given a graph G= (V ,E) and two natural numbers m and k, find a subset S ⊆ V of minimal size such that every vertex in V \ S is adjacent to at least k vertices in S and the induced graph of S is m-connected. In this paper we study this problem with unit disc graphs and small m, which is motivated by the design of fault-tolerant virtual...

متن کامل

Minimal dominating sets in interval graphs and trees

We show that interval graphs on n vertices have at most 3 ≈ 1.4422 minimal dominating sets, and that these can be enumerated in time O∗(3n/3). As there are examples of interval graphs that actually have 3 minimal dominating sets, our bound is tight. We show that the same upper bound holds also for trees, i.e. trees on n vertices have at most 3 ≈ 1.4422 minimal dominating sets. The previous best...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2014

ISSN: 0012-365X

DOI: 10.1016/j.disc.2014.06.005